On $$\alpha $$-Excellent Graphs
نویسندگان
چکیده
Abstract A graph G is $$\alpha $$ α -excellent if every vertex of contained in some maximum independent set . In this paper, we characterize bipartite graphs, unicyclic simplicial chordal block and show that generalized Petersen -excellent.
منابع مشابه
Roman domination excellent graphs: trees
A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V rightarrow {0, 1, 2}$ suchthat every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = Sigma_{vin V} f(v)$The Roman domination number, $gamma_R(G)$, of $G$ is theminimum weight of an RDF on $G$.An RDF of minimum weight is called a $gamma_R$-function.A graph G is said to be $g...
متن کاملβ 0 - Excellent Graphs
LetG = (V,E) be a simple graph. Let u ∈ V (G). u is said to be β0 good if u is contained in a β0-set of G. u is said to beβ0-bad if there exists noβ0-set of G containing u. A graph G is said to be β0excellent if every vertex of G is β0-good. In this paper, many results on β0 excellent are obtained. And some relation between some other parameters are also investigated. Mathematics Subject Classi...
متن کاملExcellent Domination in Fuzzy Graphs
Let G be a fuzzy graph. A subset D of V is said to be Fuzzy dominating set if every vertex u ∈ V (G) there exists a vertex v ∈ V −D such that uv ∈ E(G) and μ(uv) 6 σ(u) ∧ σ(v). The minimum Cardinality of fuzzy dominating set is denoted by γf . A graph G is said to be fuzzy excellent if every vertex of G belongs to γf -sets of G. In this paper, we give a construction to imbedded non-excellent fu...
متن کاملSome Notes on Proofs with Alpha Graphs
It is well-known that Peirce’s Alpha graphs correspond to propositional logic (PL). Nonetheless, Peirce’s calculus for Alpha graphs differs to a large extent to the common calculi for PL. In this paper, some aspects of Peirce’s calculus are exploited. First of all, it is shown that the erasure-rule of Peirce’s calculus, which is the only rule which does not enjoy the finite choice property, is ...
متن کاملFour-coloring Ps6-free graphs. I. Extending an excellent precoloring
This is the first paper in a series whose goal is to give a polynomial time algorithm for the 4-coloring problem and the 4-precoloring extension problem restricted to the class of graphs with no induced six-vertex path, thus proving a conjecture of Huang. Combined with previously known results this completes the classification of the complexity of the 4-coloring problem for graphs with a connec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Malaysian Mathematical Sciences Society
سال: 2023
ISSN: ['2180-4206', '0126-6705']
DOI: https://doi.org/10.1007/s40840-022-01456-0